Comparison of Meta-heuristic Hybrid Approaches for Two Dimensional Non-guillotine Rectangular Cutting Problems
نویسندگان
چکیده
In this paper, six different approaches using genetic algorithms (GA) and/or simulated annealing (SA) with improved bottom left (I-BL) algorithm [1] were applied for solution of two dimensional non-guillotine cutting problems. As examples, test problems including 29 individual rectangular pieces were used [2]. Performances of hybrid approaches on solutions of cutting problems were compared. Due to combined global search feature of GA and local search feature of SA, the hybrid approach using GA and SA yields the best results for these problems.
منابع مشابه
A simple approach to the two-dimensional guillotine cutting stock problem
Cutting stock problems are within knapsack optimization problems and are considered as a non-deterministic polynomial-time (NP)-hard problem. In this paper, two-dimensional cutting stock problems were presented in which items and stocks were rectangular and cuttings were guillotine. First, a new, practical, rapid, and heuristic method was proposed for such problems. Then, the ...
متن کاملHybrid genetic algorithm and simulated annealing for two-dimensional non-guillotine rectangular packing problems
In this paper, genetic algorithm (GA) and simulated annealing (SA) with improved bottom left (BL) algorithm were applied to twodimensional non-guillotine rectangular packing problems. The performance and efficiency of these algorithms on several test problems [Hopper, E., Turton, B.C.H., 2000. An empirical investigation of meta-heuristic and heuristic algorithms for two-dimensional packing prob...
متن کاملConstruction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
The paper examines a new problem in the irregular packing literature that has existed in industry for decades; two-dimensional irregular (convex) bin packing with guillotine constraints. Due to the cutting process of certain materials, cuts are restricted to extend from one edge of the stock-sheet to another, called guillotine cutting. This constraint is common place in glass cutting and is an ...
متن کاملIterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملIntegrated approaches for generating and sequencing cutting patterns in two-dimensional cutting stock problems
This paper deals with the classical two-dimensional cutting stock problem, which consists of generating cutting patterns to produce bi rectangular items of sizes (li,wi), i=1,..,m, from rectangular objects of sizes (L,W), so that an objective is optimized, for example, the cost or trim loss. However, to cut the patterns they should be sequenced in such a way as to optimize another objective, fo...
متن کامل